#include<stdio.h>
#include<math.h>

int isPrime( int prime ){
    if( prime == 2 )
        return 1;
    if( prime % 2 == 0 ) 
        return 0;
    
}

int main()
{
    int i, n, cnt;
    scanf("%d", &n);
        cnt = 0;
        for( i=2; n!=1 ; i++)
            if( isPrime(i) == 1 )
                while ( n%i == 0 ){
                    n /= i;
                    cnt++;
                }//if.2
                
        printf("%d\n", cnt );
    return 0;
}



